(2,1)-total labeling of trees with large maximum degree
نویسندگان
چکیده
منابع مشابه
(2,1)-Total labeling of planar graphs with large maximum degree
The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph G with maximum degree ∆ ≥ 12 and d = 2, the (2,1)-total labelling number λ2 (G) is at most ∆ + 2.
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملHarmonious coloring of trees with large maximum degree
A harmonious coloring of G is a proper vertex coloring of G such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of G, h(G), is the minimum number of colors needed for a harmonious coloring of G. We show that if T is a forest of order n with maximum degree ∆(T ) ≥ n+2 3 , then h(T ) = { ∆(T ) + 2, if T has non-adjacent vertices of degr...
متن کاملTotal colorings of planar graphs with large maximum degree
It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1. c © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 53–59, 1997
متن کاملLabeling outerplanar graphs with maximum degree three
An L(2, 1)-labeling of a graph G is an assignment of a nonnegative integer to each vertex of G such that adjacent vertices receive integers that differ by at least two and vertices at distance two receive distinct integers. The span of such a labeling is the difference between the largest and smallest integers used. The λ-number of G, denoted by λ(G), is the minimum span over all L(2, 1)-labeli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.02.019